A Parameterized Complexity Analysis of Generalized CP-Nets
نویسندگان
چکیده
Generalized CP-nets (GCP-nets) allow a succinct representation of preferences over multi-attribute domains. As a consequence of their succinct representation, many GCP-net related tasks are computationally hard. Even finding the more preferable of two outcomes is PSPACE-complete. In this work, we employ the framework of parameterized complexity to achieve two goals: First, we want to gain a deeper understanding of the complexity of GCP-nets. Second, we search for efficient fixed-parameter tractable algorithms.
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملmodeling and reasoning about preferences with cp - nets
Structured modeling of ceteris paribus qualitative preference statements, grounded in the notions of preferential independence, has tremendous potential to provide effective and efficient tools for modeling and reasoning about decision maker preferences in real-life applications. Within the AI and phylosophical logic communities, past work on qualitative preference representation has tended to ...
متن کاملOptimal Decision Making with CP-nets and PCP-nets
Probabilistic conditional preference networks (PCP-nets) are a generalization of CP-nets for compactly representing preferences over multi-attribute domains. We introduce the notion of a loss function whose inputs are a CP-net and an outcome. We focus on the optimal decision-making problem for acyclic and cyclic CP-nets and PCP-nets. Our motivations are three-fold: (1) our framework naturally e...
متن کاملA Fuzzy Approach to Sequential Failure Analysis Using Petri nets
In highly competitive industrial market, the concept of failure analysis is an unavoidable fact in complex industrial systems. Reliability of such systems not only depends on the reliability of each element of these systems, but also depends on occurrence of sequence of failures. In this paper, a novel approach to sequential failure analysis is proposed which is based upon fuzzy logic and the c...
متن کاملInteractive Learning of Acyclic Conditional Preference Networks
Learning of user preferences, as represented by, for example, Conditional Preference Networks (CP-nets), has become a core issue in AI research. Recent studies investigate learning of CP-nets from randomly chosen examples or from membership and equivalence queries. To assess the optimality of learning algorithms as well as to better understand the combinatorial structure of classes of CP-nets, ...
متن کامل